Electrical and optical properties of Si-doped indium tin oxides as transparent electrode and anti-reflection coating for solar cells

We have studied the electrical and optical properties of Si-doped indium tin oxides (ITSOs) as transparent electrodes and anti-reflection coatings for Si-based solar cells. The ITSO thin films were obtained by co-sputtering of ITO and SiO₂ targets under target power control. The resistivity of the ITSO thin films deposited at 0.625 in terms of power ratio (ITO/SiO₂) were 391 Ωcm. In this condition, the ITSO thin films showed very high resistivity compared to sputted pure ITO thin films (1.08 × 10⁻³ Ωcm). However, refractive index of ITSO thin films deposited at the same condition at 500 nm is somewhat lowered to 1.97 compared to ITO thin films (2.06). The fabricated graded refractive index AR coatings using ITO, ITSO, and SiO₂ thin films kept over 80% of transmittance regardless of their thickness varing from 97 nm to 1196 nm because of their low extinction coefficient. As the AR coating with graded refractive indices using ITO, ITSO, and SiO₂ layers was applied to general silicon-based solar cell, the current level increased nearly twice more than that of bare silicon solar cell without AR coating.     

定向回归反射玻璃微珠折射率研究

从理论上分析了玻璃微珠定向回归反射原理,利用近轴光线球面折射理论分析了玻璃微珠实现回归反射的折射率,并结合实际使用情况,在最大可能增加回归反射的基础上,讨论了入射光线到主光轴的距离与回归光线和入射光线夹角之间的关系,从而确定出了实现最大反射时玻璃微珠的折射率范围为1.80~1.95,研究结果对回归反射标志牌的开发具有重要的理论意义。     

Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited

Consider a simple graph and its proper edge coloring c with the elements of the set . We say that c is neighbor set distinguishing (or adjacent strong) if for every edge , the set of colors incident with u is distinct from the set of colors incident with v. Let us then consider a stronger requirement and suppose we wish to distinguishing adjacent vertices by sums of their incident colors. In both problems the challenging conjectures presume that such colorings exist for any graph G containing no isolated edges if only . We prove that in both problems is sufficient. The proof is based on the Combinatorial Nullstellensatz, applied in the “sum environment.” In fact the identical bound also holds if we use any set of k real numbers instead of as edge colors, and the same is true in list versions of the both concepts. In particular, we therefore obtain that lists of length ( in fact) are sufficient for planar graphs.     

向量值空间中的几何酉元

研究向量值空间中的几何酉元.通过数值指标理论刻画向量值空间C(Ω,X),L_∞(μ,X)和L(l_1(Γ),X)中几何酉元的特征,其中X是Banach空间,Ω是紧Hausdorff空间,μ是σ有限测度以及Γ是非空指标集.同时,描述了Banach空间的内射张量积和投射张量积中几何酉元的特征.     

The localized longitudinal index theorem for Lie groupoids and the van Est map

We define the “localized index” of longitudinal elliptic operators on Lie groupoids associated with Lie algebroid cohomology classes. We derive a topological expression for these numbers using the algebraic index theorem for Poisson manifolds on the dual of the Lie algebroid. Underlying the definition and computation of the localized index, is an action of the Hopf algebroid of jets around the unit space, and the characteristic map it induces on Lie algebroid cohomology. This map can be globalized to differentiable groupoid cohomology, giving a definition of the “global index”, that can be computed by localization. This correspondence between the “global” and “localized” index is given by the van Est map for Lie groupoids.     

Asymptotically optimal neighbour sum distinguishing colourings of graphs

Consider a simple graph G = (V,E) and its proper edge colouring c with the elements of the set {1,2,…,k}. The colouring c is said to be neighbour sum distinguishing if for every pair of vertices u, v adjacent in G, the sum of colours of the edges incident with u is distinct from the corresponding sum for v. The smallest integer k for which such colouring exists is known as the neighbour sum distinguishing index of a graph and denoted by . The definition of this parameter, which makes sense for graphs containing no isolated edges, immediately implies that , where Δ is the maximum degree of G. On the other hand, it was conjectured by Flandrin et al. that for all those graphs, except for C₅. We prove this bound to be asymptotically correct by showing that . The main idea of our argument relays on a random assignment of the colours, where the choice for every edge is biased by so called attractors, randomly assigned to the vertices. © 2014 Wiley Periodicals, Inc. Random Struct. Alg., 47, 776–791, 2015     

环状硅酸盐图的友好指数集

Let G be a graph with vertex set V(G) and edge set E(G). A labeling f : V(G) →Z2 induces an edge labeling f*: E(G) → Z2 defined by f*(xy) = f(x) + f(y), for each edge xy ∈ E(G). For i ∈ Z2, let vf(i) = |{v ∈ V(G) : f(v) = i}| and ef(i) = |{e ∈ E(G) : f*(e) =i}|. A labeling f of a graph G is said to be friendly if |vf(0)- vf(1)| ≤ 1. The friendly index set of the graph G, denoted FI(G), is defined as {|ef(0)- ef(1)|: the vertex labeling f is friendly}. This is a generalization of graph cordiality. We investigate the friendly index sets of cyclic silicates CS(n, m).     

Forwarding and optical indices of 4-regular circulant networks

An all-to-all routing in a graph G is a set of oriented paths of G, with exactly one path for each ordered pair of vertices. The load of an edge under an all-to-all routing R is the number of times it is used (in either direction) by paths of R, and the maximum load of an edge is denoted by $\pi (G,R)$. The edge-forwarding index $\pi (G)$ is the minimum of $\pi (G,R)$ over all possible all-to-all routings R, and the arc-forwarding index $\overrightarrow{\pi }(G)$ is defined similarly by taking direction into consideration, where an arc is an ordered pair of adjacent vertices. Denote by $w(G,R)$ the minimum number of colours required to colour the paths of R such that any two paths having an edge in common receive distinct colours. The optical index $w(G)$ is defined to be the minimum of $w(G,R)$ over all possible R, and the directed optical index $\overrightarrow{w}(G)$ is defined similarly by requiring that any two paths having an arc in common receive distinct colours. In this paper we obtain lower and upper bounds on these four invariants for 4-regular circulant graphs with connection set $\{\pm 1,\pm s\}$, $1<s<n/2$. We give approximation algorithms with performance ratio a small constant for the corresponding forwarding index and routing and wavelength assignment problems for some families of 4-regular circulant graphs.